Hermitian Adjacency Matrix of Digraphs and Mixed Graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nullity of Hermitian-Adjacency Matrices of Mixed Graphs

A mixed graph means a graph containing both oriented edges and undirected edges. The nullity of the Hermitian-adjacency matrix of a mixed graph G, denoted by ηH(G), is referred to as the multiplicity of the eigenvalue zero. In this paper, for a mixed unicyclic graph G with given order and matching number, we give a formula on ηH(G), which combines the cases of undirected and oriented unicyclic ...

متن کامل

Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs

Let M be a mixed graph and [Formula: see text] be its Hermitian-adjacency matrix. If we add a Randić weight to every edge and arc in M, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix? Motivated by this, we define the Hermitian-Randić matrix [Formula: see text] of a mixed graph M, where [Formula: see text] ([Formula: see text]) if [Formula: ...

متن کامل

THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS

In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...

متن کامل

On Digraphs with Non-derogatory Adjacency Matrix

Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if . 0 )) ( ( = G A f G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, i.e., the ladder digraphs and the difans, are annihilatingly unique by studying the similari...

متن کامل

Vertex Removable Cycles of Graphs and Digraphs

‎In this paper we defined the vertex removable cycle in respect of the following‎, ‎if $F$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$G in F $‎, ‎the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $.‎ ‎The vertex removable cycles of eulerian graphs are studied‎. ‎We also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎    

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Theory

سال: 2016

ISSN: 0364-9024

DOI: 10.1002/jgt.22057